0.03/0.13	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : run_vampire %s %d THM
0.12/0.34	% Computer : n024.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 1920
0.12/0.34	% WCLimit    : 240
0.12/0.34	% DateTime   : Wed Jul 30 02:36:34 EDT 2025
0.12/0.34	% CPUTime    : 
0.21/0.36	This is a THF_ problem
0.21/0.36	Running higher-order theorem proving
0.21/0.37	Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p -m 16384 -t 240
0.21/0.39	% (6594)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/4Mi)
0.21/0.39	% (6595)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/27Mi)
0.21/0.39	% (6596)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/2Mi)
0.21/0.39	% (6598)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/275Mi)
0.21/0.39	% (6597)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/2Mi)
0.21/0.39	% (6599)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/18Mi)
0.21/0.39	% (6593)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/183Mi)
0.21/0.39	% (6596)Instruction limit reached!
0.21/0.39	% (6596)------------------------------
0.21/0.39	% (6596)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.39	% (6596)Termination reason: Unknown
0.21/0.39	% (6597)Instruction limit reached!
0.21/0.39	% (6597)------------------------------
0.21/0.39	% (6597)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.39	% (6596)Termination phase: Preprocessing 3
0.21/0.39	
0.21/0.39	% (6596)Memory used [KB]: 1023
0.21/0.39	% (6596)Time elapsed: 0.004 s
0.21/0.39	% (6596)Instructions burned: 3 (million)
0.21/0.39	% (6596)------------------------------
0.21/0.39	% (6596)------------------------------
0.21/0.39	% (6597)Termination reason: Unknown
0.21/0.39	% (6597)Termination phase: Property scanning
0.21/0.39	
0.21/0.39	% (6597)Memory used [KB]: 1023
0.21/0.39	% (6597)Time elapsed: 0.004 s
0.21/0.39	% (6597)Instructions burned: 3 (million)
0.21/0.39	% (6597)------------------------------
0.21/0.39	% (6597)------------------------------
0.21/0.39	% (6594)Instruction limit reached!
0.21/0.39	% (6594)------------------------------
0.21/0.39	% (6594)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.39	% (6594)Termination reason: Unknown
0.21/0.39	% (6594)Termination phase: Saturation
0.21/0.39	
0.21/0.39	% (6594)Memory used [KB]: 1023
0.21/0.39	% (6594)Time elapsed: 0.005 s
0.21/0.39	% (6594)Instructions burned: 4 (million)
0.21/0.39	% (6594)------------------------------
0.21/0.39	% (6594)------------------------------
0.21/0.40	% (6599)Instruction limit reached!
0.21/0.40	% (6599)------------------------------
0.21/0.40	% (6599)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.40	% (6599)Termination reason: Unknown
0.21/0.40	% (6599)Termination phase: Saturation
0.21/0.40	
0.21/0.40	% (6599)Memory used [KB]: 5628
0.21/0.40	% (6599)Time elapsed: 0.014 s
0.21/0.40	% (6599)Instructions burned: 18 (million)
0.21/0.40	% (6599)------------------------------
0.21/0.40	% (6599)------------------------------
0.21/0.41	% (6595)Instruction limit reached!
0.21/0.41	% (6595)------------------------------
0.21/0.41	% (6595)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.41	% (6600)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/3Mi)
0.21/0.41	% (6595)Termination reason: Unknown
0.21/0.41	% (6595)Termination phase: Saturation
0.21/0.41	
0.21/0.41	% (6601)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/37Mi)
0.21/0.41	% (6595)Memory used [KB]: 5756
0.21/0.41	% (6595)Time elapsed: 0.020 s
0.21/0.41	% (6595)Instructions burned: 27 (million)
0.21/0.41	% (6595)------------------------------
0.21/0.41	% (6595)------------------------------
0.21/0.41	% (6600)Instruction limit reached!
0.21/0.41	% (6600)------------------------------
0.21/0.41	% (6600)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.41	% (6600)Termination reason: Unknown
0.21/0.41	% (6600)Termination phase: Property scanning
0.21/0.41	
0.21/0.41	% (6600)Memory used [KB]: 1023
0.21/0.41	% (6600)Time elapsed: 0.004 s
0.21/0.41	% (6600)Instructions burned: 4 (million)
0.21/0.41	% (6600)------------------------------
0.21/0.41	% (6600)------------------------------
0.21/0.41	% (6602)lrs+2_16:1_acc=model:au=on:bd=off:c=on:e2e=on:nm=2:sos=all:i=15:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/15Mi)
0.21/0.42	% (6603)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/3Mi)
0.21/0.42	% (6603)Instruction limit reached!
0.21/0.42	% (6603)------------------------------
0.21/0.42	% (6603)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.42	% (6603)Termination reason: Unknown
0.21/0.42	% (6603)Termination phase: Property scanning
0.21/0.42	
0.21/0.42	% (6603)Memory used [KB]: 1023
0.21/0.42	% (6603)Time elapsed: 0.004 s
0.21/0.42	% (6603)Instructions burned: 4 (million)
0.21/0.42	% (6603)------------------------------
0.21/0.42	% (6603)------------------------------
0.21/0.42	% (6602)Instruction limit reached!
0.21/0.42	% (6602)------------------------------
0.21/0.42	% (6602)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.42	% (6602)Termination reason: Unknown
0.21/0.42	% (6602)Termination phase: Saturation
0.21/0.42	
0.21/0.42	% (6602)Memory used [KB]: 5756
0.21/0.42	% (6602)Time elapsed: 0.036 s
0.21/0.42	% (6602)Instructions burned: 16 (million)
0.21/0.42	% (6602)------------------------------
0.21/0.42	% (6602)------------------------------
0.21/0.42	% (6604)lrs+1002_1:1_aac=none:au=on:cnfonf=lazy_gen:plsq=on:plsqc=1:plsqr=4203469,65536:i=1041:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/1041Mi)
0.21/0.42	% (6605)lrs+10_1:1_av=off:chr=on:plsq=on:slsq=on:i=7:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/7Mi)
0.21/0.43	% (6605)Instruction limit reached!
0.21/0.43	% (6605)------------------------------
0.21/0.43	% (6605)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.43	% (6605)Termination reason: Unknown
0.21/0.43	% (6605)Termination phase: Saturation
0.21/0.43	
0.21/0.43	% (6605)Memory used [KB]: 1023
0.21/0.43	% (6605)Time elapsed: 0.006 s
0.21/0.43	% (6605)Instructions burned: 7 (million)
0.21/0.43	% (6605)------------------------------
0.21/0.43	% (6605)------------------------------
0.21/0.43	% (6601)Instruction limit reached!
0.21/0.43	% (6601)------------------------------
0.21/0.43	% (6601)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.43	% (6601)Termination reason: Unknown
0.21/0.43	% (6601)Termination phase: Saturation
0.21/0.43	
0.21/0.43	% (6601)Memory used [KB]: 5756
0.21/0.43	% (6601)Time elapsed: 0.025 s
0.21/0.43	% (6601)Instructions burned: 38 (million)
0.21/0.43	% (6601)------------------------------
0.21/0.43	% (6601)------------------------------
0.21/0.43	% (6606)lrs+10_1:1_acc=on:amm=sco:cs=on:tgt=full:i=16:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/16Mi)
0.21/0.44	% (6607)lrs+21_1:1_au=on:cnfonf=off:fd=preordered:fe=off:fsr=off:hud=11:inj=on:kws=precedence:s2pl=no:sp=weighted_frequency:tgt=full:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/3Mi)
0.21/0.44	% (6607)Instruction limit reached!
0.21/0.44	% (6607)------------------------------
0.21/0.44	% (6607)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.21/0.44	% (6607)Termination reason: Unknown
0.21/0.44	% (6607)Termination phase: Function definition elimination
0.21/0.44	
0.21/0.44	% (6607)Memory used [KB]: 1023
0.21/0.44	% (6607)Time elapsed: 0.004 s
0.21/0.44	% (6607)Instructions burned: 3 (million)
0.21/0.44	% (6607)------------------------------
0.21/0.44	% (6607)------------------------------
0.22/0.44	% (6608)lrs+2_1:1_apa=on:au=on:bd=preordered:cnfonf=off:cs=on:ixr=off:sos=on:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/3Mi)
0.22/0.44	% (6606)Instruction limit reached!
0.22/0.44	% (6606)------------------------------
0.22/0.44	% (6606)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.44	% (6606)Termination reason: Unknown
0.22/0.44	% (6606)Termination phase: Saturation
0.22/0.44	
0.22/0.44	% (6606)Memory used [KB]: 5884
0.22/0.44	% (6606)Time elapsed: 0.035 s
0.22/0.44	% (6609)lrs+10_1:1_cnfonf=off:cs=on:hud=3:prag=on:sup=off:i=7:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/7Mi)
0.22/0.44	% (6606)Instructions burned: 16 (million)
0.22/0.44	% (6606)------------------------------
0.22/0.44	% (6606)------------------------------
0.22/0.45	% (6608)Instruction limit reached!
0.22/0.45	% (6608)------------------------------
0.22/0.45	% (6608)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.45	% (6608)Termination reason: Unknown
0.22/0.45	% (6608)Termination phase: Function definition elimination
0.22/0.45	
0.22/0.45	% (6608)Memory used [KB]: 1023
0.22/0.45	% (6608)Time elapsed: 0.004 s
0.22/0.45	% (6608)Instructions burned: 4 (million)
0.22/0.45	% (6608)------------------------------
0.22/0.45	% (6608)------------------------------
0.22/0.45	% (6609)Refutation not found, incomplete strategy
0.22/0.45	% (6609)------------------------------
0.22/0.45	% (6609)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.45	% (6609)Termination reason: Refutation not found, incomplete strategy
0.22/0.45	
0.22/0.45	
0.22/0.45	% (6609)Memory used [KB]: 5500
0.22/0.45	% (6609)Time elapsed: 0.005 s
0.22/0.45	% (6609)Instructions burned: 5 (million)
0.22/0.45	% (6609)------------------------------
0.22/0.45	% (6609)------------------------------
0.22/0.45	% (6610)dis+1002_1:1_add=large:cnfonf=lazy_pi_sigma_gen:fe=off:prag=on:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/3Mi)
0.22/0.46	% (6610)Instruction limit reached!
0.22/0.46	% (6610)------------------------------
0.22/0.46	% (6610)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.46	% (6610)Termination reason: Unknown
0.22/0.46	% (6610)Termination phase: Property scanning
0.22/0.46	
0.22/0.46	% (6610)Memory used [KB]: 1023
0.22/0.46	% (6610)Time elapsed: 0.004 s
0.22/0.46	% (6610)Instructions burned: 4 (million)
0.22/0.46	% (6610)------------------------------
0.22/0.46	% (6610)------------------------------
0.22/0.46	% (6611)dis+1004_1:1_cha=on:cs=on:fe=off:hud=1:i=4:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/4Mi)
0.22/0.46	% (6612)lrs+1002_1:1_anc=all_dependent:au=on:cbe=off:fde=unused:ntd=on:i=18:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/18Mi)
0.22/0.46	% (6611)Instruction limit reached!
0.22/0.46	% (6611)------------------------------
0.22/0.46	% (6611)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.46	% (6611)Termination reason: Unknown
0.22/0.46	% (6611)Termination phase: Saturation
0.22/0.46	
0.22/0.46	% (6611)Memory used [KB]: 5500
0.22/0.46	% (6611)Time elapsed: 0.004 s
0.22/0.46	% (6611)Instructions burned: 5 (million)
0.22/0.46	% (6611)------------------------------
0.22/0.46	% (6611)------------------------------
0.22/0.46	% (6613)lrs+10_1:1_e2e=on:sd=1:sgt=8:ss=axioms:i=710:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/710Mi)
0.22/0.47	% (6614)lrs+1004_1:1_chr=on:prag=on:i=6:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/6Mi)
0.22/0.47	% (6612)Instruction limit reached!
0.22/0.47	% (6612)------------------------------
0.22/0.47	% (6612)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.47	% (6612)Termination reason: Unknown
0.22/0.47	% (6612)Termination phase: Saturation
0.22/0.47	
0.22/0.47	% (6612)Memory used [KB]: 5628
0.22/0.47	% (6612)Time elapsed: 0.014 s
0.22/0.47	% (6612)Instructions burned: 18 (million)
0.22/0.47	% (6612)------------------------------
0.22/0.47	% (6612)------------------------------
0.22/0.48	% (6614)Instruction limit reached!
0.22/0.48	% (6614)------------------------------
0.22/0.48	% (6614)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.48	% (6614)Termination reason: Unknown
0.22/0.48	% (6614)Termination phase: Saturation
0.22/0.48	
0.22/0.48	% (6614)Memory used [KB]: 5500
0.22/0.48	% (6614)Time elapsed: 0.006 s
0.22/0.48	% (6614)Instructions burned: 7 (million)
0.22/0.48	% (6614)------------------------------
0.22/0.48	% (6614)------------------------------
0.22/0.48	% (6615)dis+1002_5:1_au=on:bd=off:e2e=on:fde=none:fs=off:fsr=off:sos=on:i=902:si=on:rtra=on_0 on E---3.1_6485 for (2399ds/902Mi)
0.22/0.49	% (6616)dis+21_1:8_apa=on:cnfonf=off:fd=off:fsr=off:hud=0:ins=1:kws=inv_frequency:nwc=10.0:ss=axioms:st=5.0:i=21:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/21Mi)
0.22/0.49	% (6598)Instruction limit reached!
0.22/0.49	% (6598)------------------------------
0.22/0.49	% (6598)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.49	% (6598)Termination reason: Unknown
0.22/0.49	% (6598)Termination phase: Saturation
0.22/0.49	
0.22/0.49	% (6598)Memory used [KB]: 5756
0.22/0.49	% (6598)Time elapsed: 0.105 s
0.22/0.49	% (6598)Instructions burned: 277 (million)
0.22/0.49	% (6598)------------------------------
0.22/0.49	% (6598)------------------------------
0.22/0.49	% (6617)dis+10_1:1_cnfonf=lazy_gen:fe=off:i=5:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/5Mi)
0.22/0.49	% (6617)Instruction limit reached!
0.22/0.49	% (6617)------------------------------
0.22/0.49	% (6617)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.49	% (6617)Termination reason: Unknown
0.22/0.49	% (6617)Termination phase: Saturation
0.22/0.49	
0.22/0.49	% (6617)Memory used [KB]: 5500
0.22/0.49	% (6617)Time elapsed: 0.005 s
0.22/0.49	% (6617)Instructions burned: 5 (million)
0.22/0.49	% (6617)------------------------------
0.22/0.49	% (6617)------------------------------
0.22/0.50	% (6593)Instruction limit reached!
0.22/0.50	% (6593)------------------------------
0.22/0.50	% (6593)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.50	% (6593)Termination reason: Unknown
0.22/0.50	% (6593)Termination phase: Saturation
0.22/0.50	
0.22/0.50	% (6593)Memory used [KB]: 6140
0.22/0.50	% (6593)Time elapsed: 0.111 s
0.22/0.50	% (6593)Instructions burned: 184 (million)
0.22/0.50	% (6593)------------------------------
0.22/0.50	% (6593)------------------------------
0.22/0.50	% (6616)Instruction limit reached!
0.22/0.50	% (6616)------------------------------
0.22/0.50	% (6616)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.50	% (6616)Termination reason: Unknown
0.22/0.50	% (6616)Termination phase: Saturation
0.22/0.50	
0.22/0.50	% (6616)Memory used [KB]: 5628
0.22/0.50	% (6616)Time elapsed: 0.014 s
0.22/0.50	% (6616)Instructions burned: 22 (million)
0.22/0.50	% (6616)------------------------------
0.22/0.50	% (6616)------------------------------
0.22/0.50	% (6618)lrs+2_1:1_cnfonf=lazy_not_gen_be_off:cs=on:fe=off:hud=10:inj=on:ins=3:plsq=on:plsqc=1:sd=10:ss=axioms:tnu=1:i=6:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/6Mi)
0.22/0.51	% (6618)Instruction limit reached!
0.22/0.51	% (6618)------------------------------
0.22/0.51	% (6618)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.51	% (6618)Termination reason: Unknown
0.22/0.51	% (6618)Termination phase: Saturation
0.22/0.51	
0.22/0.51	% (6618)Memory used [KB]: 5500
0.22/0.51	% (6618)Time elapsed: 0.004 s
0.22/0.51	% (6618)Instructions burned: 6 (million)
0.22/0.51	% (6618)------------------------------
0.22/0.51	% (6618)------------------------------
0.22/0.51	% (6619)lrs+1002_1:128_au=on:c=on:fsr=off:piset=equals:i=377:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/377Mi)
0.22/0.51	% (6620)dis+1010_1:4_atotf=0.2:c=on:cbe=off:cnfonf=lazy_simp:fe=off:ins=2:ntd=on:s2a=on:s2at=5.0:sgt=5:ss=axioms:st=1.5:i=779:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/779Mi)
0.22/0.51	% (6621)lrs+10_1:1_cnfonf=lazy_not_be_gen:ntd=on:sp=const_min:ss=axioms:sup=off:i=19:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/19Mi)
0.22/0.52	% (6621)Refutation not found, incomplete strategy
0.22/0.52	% (6621)------------------------------
0.22/0.52	% (6621)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.52	% (6621)Termination reason: Refutation not found, incomplete strategy
0.22/0.52	
0.22/0.52	
0.22/0.52	% (6621)Memory used [KB]: 5628
0.22/0.52	% (6621)Time elapsed: 0.007 s
0.22/0.52	% (6621)Instructions burned: 11 (million)
0.22/0.52	% (6621)------------------------------
0.22/0.52	% (6621)------------------------------
0.22/0.52	% (6622)lrs+1010_1:1_au=on:s2a=on:sd=1:sgt=50:ss=axioms:i=879:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/879Mi)
0.22/0.53	% (6623)dis+1002_1:128_acc=on:er=filter:i=17:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/17Mi)
0.22/0.53	% (6623)Instruction limit reached!
0.22/0.53	% (6623)------------------------------
0.22/0.53	% (6623)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.53	% (6623)Termination reason: Unknown
0.22/0.53	% (6623)Termination phase: Saturation
0.22/0.53	
0.22/0.53	% (6623)Memory used [KB]: 5628
0.22/0.53	% (6623)Time elapsed: 0.009 s
0.22/0.53	% (6623)Instructions burned: 19 (million)
0.22/0.53	% (6623)------------------------------
0.22/0.53	% (6623)------------------------------
0.22/0.54	% (6624)ott+21_1:1_apa=on:au=on:cnfonf=off:sos=on:i=3:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/3Mi)
0.22/0.54	% (6624)Instruction limit reached!
0.22/0.54	% (6624)------------------------------
0.22/0.54	% (6624)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
0.22/0.54	% (6624)Termination reason: Unknown
0.22/0.54	% (6624)Termination phase: Function definition elimination
0.22/0.54	
0.22/0.54	% (6624)Memory used [KB]: 1023
0.22/0.54	% (6624)Time elapsed: 0.003 s
0.22/0.54	% (6624)Instructions burned: 4 (million)
0.22/0.54	% (6624)------------------------------
0.22/0.54	% (6624)------------------------------
1.34/0.55	% (6625)lrs+1010_1:8_cnfonf=off:hud=1:inj=on:tnu=5:i=30:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/30Mi)
1.34/0.56	% (6625)Refutation not found, incomplete strategy
1.34/0.56	% (6625)------------------------------
1.34/0.56	% (6625)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
1.34/0.56	% (6625)Termination reason: Refutation not found, incomplete strategy
1.34/0.56	
1.34/0.56	
1.34/0.56	% (6625)Memory used [KB]: 5500
1.34/0.56	% (6625)Time elapsed: 0.004 s
1.34/0.56	% (6625)Instructions burned: 6 (million)
1.34/0.56	% (6625)------------------------------
1.34/0.56	% (6625)------------------------------
1.47/0.57	% (6626)dis+10_1:1_ixr=off:plsq=on:plsqc=1:plsqr=32,1:s2a=on:i=127:si=on:rtra=on_0 on E---3.1_6485 for (2398ds/127Mi)
1.47/0.61	% (6626)Instruction limit reached!
1.47/0.61	% (6626)------------------------------
1.47/0.61	% (6626)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
1.47/0.61	% (6626)Termination reason: Unknown
1.47/0.61	% (6626)Termination phase: Saturation
1.47/0.61	
1.47/0.61	% (6626)Memory used [KB]: 5756
1.47/0.61	% (6626)Time elapsed: 0.046 s
1.47/0.61	% (6626)Instructions burned: 127 (million)
1.47/0.61	% (6626)------------------------------
1.47/0.61	% (6626)------------------------------
1.47/0.61	% (6613)First to succeed.
1.47/0.62	% (6613)Refutation found. Thanks to Tanya!
1.47/0.62	% SZS status Theorem for E---3.1_6485
1.47/0.62	% SZS output start Proof for E---3.1_6485
1.47/0.62	thf(func_def_0, type, in: $i > $i > $o).
1.47/0.62	thf(func_def_2, type, setadjoin: $i > $i > $i).
1.47/0.62	thf(func_def_3, type, setunion: $i > $i).
1.47/0.62	thf(func_def_4, type, dsetconstr: $i > ($i > $o) > $i).
1.47/0.62	thf(func_def_5, type, subset: $i > $i > $o).
1.47/0.62	thf(func_def_9, type, singleton: $i > $o).
1.47/0.62	thf(func_def_12, type, if: $i > $o > $i > $i > $i).
1.47/0.62	thf(func_def_25, type, sK0: $i > $o).
1.47/0.62	thf(func_def_40, type, sK15: $i > $i > $i > $o > $i).
1.47/0.62	thf(func_def_41, type, ph16: !>[X0: $tType]:(X0)).
1.47/0.62	thf(func_def_42, type, sK17: $o > $i).
1.47/0.62	thf(func_def_43, type, sK18: $o > $i).
1.47/0.62	thf(f1288,plain,(
1.47/0.62	  $false),
1.47/0.62	  inference(avatar_sat_refutation,[],[f469,f500,f695,f1287])).
1.47/0.62	thf(f1287,plain,(
1.47/0.62	  ~spl14_1),
1.47/0.62	  inference(avatar_contradiction_clause,[],[f1286])).
1.47/0.62	thf(f1286,plain,(
1.47/0.62	  $false | ~spl14_1),
1.47/0.62	  inference(trivial_inequality_removal,[],[f1278])).
1.47/0.62	thf(f1278,plain,(
1.47/0.62	  ($true != $true) | ~spl14_1),
1.47/0.62	  inference(superposition,[],[f96,f1182])).
1.47/0.62	thf(f1182,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0)) ) | ~spl14_1),
1.47/0.62	  inference(trivial_inequality_removal,[],[f1181])).
1.47/0.62	thf(f1181,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | ($false = $true)) ) | ~spl14_1),
1.47/0.62	  inference(forward_demodulation,[],[f1180,f453])).
1.47/0.62	thf(f453,plain,(
1.47/0.62	  (sK4 = $false) | ~spl14_1),
1.47/0.62	  inference(avatar_component_clause,[],[f451])).
1.47/0.62	thf(f451,plain,(
1.47/0.62	  spl14_1 <=> (sK4 = $false)),
1.47/0.62	  introduced(avatar_definition,[new_symbols(naming,[spl14_1])])).
1.47/0.62	thf(f1180,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | (sK4 = $true)) ) | ~spl14_1),
1.47/0.62	  inference(subsumption_resolution,[],[f1106,f1179])).
1.47/0.62	thf(f1179,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | (sK5 = (sK18 @ X0))) ) | ~spl14_1),
1.47/0.62	  inference(trivial_inequality_removal,[],[f1178])).
1.47/0.62	thf(f1178,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = $true) | (sK5 = (sK18 @ X0)) | ($true = X0)) ) | ~spl14_1),
1.47/0.62	  inference(forward_demodulation,[],[f1127,f453])).
1.47/0.62	thf(f1127,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK4 = $true) | (sK5 = (sK18 @ X0)) | ($true = X0)) )),
1.47/0.62	  inference(duplicate_literal_removal,[],[f1126])).
1.47/0.62	thf(f1126,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK5 = (sK18 @ X0)) | (sK4 = $true) | (sK5 = (sK18 @ X0)) | ($true = X0)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f1121])).
1.47/0.62	thf(f1121,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | (sK5 = (sK18 @ X0)) | (sK4 = $true) | ((sK5 = (sK18 @ X0)) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1114])).
1.47/0.62	thf(f1114,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK3 = (sK18 @ X0)) & X0) = $true) | (sK4 = $true) | (sK5 = (sK18 @ X0)) | ((sK5 = (sK18 @ X0)) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1113])).
1.47/0.62	thf(f1113,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK4 = $true) | (((~ X0) & (sK5 = (sK18 @ X0))) = $true) | (((sK3 = (sK18 @ X0)) & X0) = $true) | (sK5 = (sK18 @ X0))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1112])).
1.47/0.62	thf(f1112,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK5 = (sK18 @ X0)) | ($true = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0))))) | (sK4 = $true)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f1111])).
1.47/0.62	thf(f1111,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK4 = $true) | ((sK5 = (sK18 @ X0)) = $true) | ($true = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0)))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1109])).
1.47/0.62	thf(f1109,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = (sK4 & (sK3 = (sK18 @ X0)))) | ((sK5 = (sK18 @ X0)) = $true) | ($true = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0)))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1107])).
1.47/0.62	thf(f1107,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK5 = (sK18 @ X0)) & (~ sK4)) = $true) | ($true = (sK4 & (sK3 = (sK18 @ X0)))) | ($true = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0)))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1077])).
1.47/0.62	thf(f1077,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK4 & (sK3 = (sK18 @ X0))) | ((sK5 = (sK18 @ X0)) & (~ sK4))) = $true) | ($true = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0)))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1076])).
1.47/0.62	thf(f1076,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK4 & (sK3 = (sK18 @ X0))) | ((sK5 = (sK18 @ X0)) & (~ sK4))) != (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0)))))) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f1075])).
1.47/0.62	thf(f1075,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))) @ (sK18 @ X0)) != ((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) @ (sK18 @ X0)))) )),
1.47/0.62	  inference(negative_extensionality,[],[f1074])).
1.47/0.62	thf(f1074,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f1073])).
1.47/0.62	thf(f1073,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true != $true) | ((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))) )),
1.47/0.62	  inference(backward_demodulation,[],[f213,f1072])).
1.47/0.62	thf(f1072,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) @ sK2) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f1064])).
1.47/0.62	thf(f1064,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) @ sK2) = $true) | ($false = $true)) )),
1.47/0.62	  inference(superposition,[],[f259,f147])).
1.47/0.62	thf(f147,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) = $true)) )),
1.47/0.62	  inference(backward_demodulation,[],[f115,f144])).
1.47/0.62	thf(f144,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset) = (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0))))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f140])).
1.47/0.62	thf(f140,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset) = (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))) | ($true != $true)) )),
1.47/0.62	  inference(superposition,[],[f120,f55])).
1.47/0.62	thf(f55,plain,(
1.47/0.62	  ((in @ sK5 @ sK2) = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f36,plain,(
1.47/0.62	  (theprop = $true) & (ifSingleton = $true) & (((in @ sK3 @ sK2) = $true) & (((in @ sK5 @ sK2) = $true) & ((in @ (if @ sK2 @ sK4 @ sK3 @ sK5) @ sK2) != $true))) & (subsetE = $true) & (sepSubset = $true)),
1.47/0.62	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f25,f35,f34])).
1.47/0.62	thf(f34,plain,(
1.47/0.62	  ? [X0,X1,X2 : $o] : (((in @ X1 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ (if @ X0 @ X2 @ X1 @ X3) @ X0) != $true))) => (((in @ sK3 @ sK2) = $true) & ? [X3] : (((in @ X3 @ sK2) = $true) & ((in @ (if @ sK2 @ sK4 @ sK3 @ X3) @ sK2) != $true)))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f35,plain,(
1.47/0.62	  ? [X3] : (((in @ X3 @ sK2) = $true) & ((in @ (if @ sK2 @ sK4 @ sK3 @ X3) @ sK2) != $true)) => (((in @ sK5 @ sK2) = $true) & ((in @ (if @ sK2 @ sK4 @ sK3 @ sK5) @ sK2) != $true))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f25,plain,(
1.47/0.62	  (theprop = $true) & (ifSingleton = $true) & ? [X0,X1,X2 : $o] : (((in @ X1 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ (if @ X0 @ X2 @ X1 @ X3) @ X0) != $true))) & (subsetE = $true) & (sepSubset = $true)),
1.47/0.62	  inference(flattening,[],[f24])).
1.47/0.62	thf(f24,plain,(
1.47/0.62	  (((? [X0,X1,X2 : $o] : (((in @ X1 @ X0) = $true) & ? [X3] : (((in @ X3 @ X0) = $true) & ((in @ (if @ X0 @ X2 @ X1 @ X3) @ X0) != $true))) & (ifSingleton = $true)) & (theprop = $true)) & (sepSubset = $true)) & (subsetE = $true)),
1.47/0.62	  inference(ennf_transformation,[],[f19])).
1.47/0.62	thf(f19,plain,(
1.47/0.62	  ~((subsetE = $true) => ((sepSubset = $true) => ((theprop = $true) => ((ifSingleton = $true) => ! [X0,X1,X2 : $o] : (((in @ X1 @ X0) = $true) => ! [X3] : (((in @ X3 @ X0) = $true) => ((in @ (if @ X0 @ X2 @ X1 @ X3) @ X0) = $true)))))))),
1.47/0.62	  inference(fool_elimination,[],[f18])).
1.47/0.62	thf(f18,plain,(
1.47/0.62	  ~(subsetE => (sepSubset => (theprop => (ifSingleton => ! [X0,X1,X2 : $o] : ((in @ X1 @ X0) => ! [X3] : ((in @ X3 @ X0) => (in @ (if @ X0 @ X2 @ X1 @ X3) @ X0)))))))),
1.47/0.62	  inference(rectify,[],[f8])).
1.47/0.62	thf(f8,negated_conjecture,(
1.47/0.62	  ~(subsetE => (sepSubset => (theprop => (ifSingleton => ! [X0,X2,X3 : $o] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (in @ (if @ X0 @ X3 @ X2 @ X5) @ X0)))))))),
1.47/0.62	  inference(negated_conjecture,[],[f7])).
1.47/0.62	thf(f7,conjecture,(
1.47/0.62	  subsetE => (sepSubset => (theprop => (ifSingleton => ! [X0,X2,X3 : $o] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (in @ (if @ X0 @ X3 @ X2 @ X5) @ X0))))))),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',ifp)).
1.47/0.62	thf(f120,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $o] : (((in @ X0 @ sK2) != $true) | ((dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X1) | ((~ X1) & (X0 = Y0))))) = (setadjoin @ (sK15 @ sK2 @ X0 @ sK3 @ X1) @ emptyset))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f117])).
1.47/0.62	thf(f117,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $o] : (((dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X1) | ((~ X1) & (X0 = Y0))))) = (setadjoin @ (sK15 @ sK2 @ X0 @ sK3 @ X1) @ emptyset)) | ($true != $true) | ((in @ X0 @ sK2) != $true)) )),
1.47/0.62	  inference(superposition,[],[f92,f56])).
1.47/0.62	thf(f56,plain,(
1.47/0.62	  ((in @ sK3 @ sK2) = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f92,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (($true != (in @ X4 @ X6)) | ((in @ X7 @ X6) != $true) | ((dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0))))) = (setadjoin @ (sK15 @ X6 @ X7 @ X4 @ X5) @ emptyset))) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f90])).
1.47/0.62	thf(f90,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (((in @ X7 @ X6) != $true) | (((setadjoin @ (sK15 @ X6 @ X7 @ X4 @ X5) @ emptyset) = (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true) | ($true != (in @ X4 @ X6))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f89])).
1.47/0.62	thf(f89,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (((in @ X7 @ X6) != $true) | (((in @ (sK15 @ X6 @ X7 @ X4 @ X5) @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) & ((setadjoin @ (sK15 @ X6 @ X7 @ X4 @ X5) @ emptyset) = (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0))))))) = $true) | ($true != (in @ X4 @ X6))) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f88])).
1.47/0.62	thf(f88,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : ((((^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X6 @ (^[Y1 : $i]: (((X4 = Y1) & X5) | ((~ X5) & (X7 = Y1)))))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X6 @ (^[Y1 : $i]: (((X4 = Y1) & X5) | ((~ X5) & (X7 = Y1)))))))) @ (sK15 @ X6 @ X7 @ X4 @ X5)) = $true) | ((in @ X7 @ X6) != $true) | ($true != (in @ X4 @ X6))) )),
1.47/0.62	  inference(sigma_clausification,[],[f87])).
1.47/0.62	thf(f87,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (((in @ X7 @ X6) != $true) | ($true != (in @ X4 @ X6)) | ((?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ (dsetconstr @ X6 @ (^[Y1 : $i]: (((X4 = Y1) & X5) | ((~ X5) & (X7 = Y1)))))) & ((setadjoin @ Y0 @ emptyset) = (dsetconstr @ X6 @ (^[Y1 : $i]: (((X4 = Y1) & X5) | ((~ X5) & (X7 = Y1))))))))) = $true)) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f86])).
1.47/0.62	thf(f86,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : ((((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true) | ($true != (in @ X4 @ X6)) | ((in @ X7 @ X6) != $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f78])).
1.47/0.62	thf(f78,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : ((((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true) | ((in @ X7 @ X6) != $true) | ($true != $true) | ($true != (in @ X4 @ X6))) )),
1.47/0.62	  inference(definition_unfolding,[],[f60,f59,f57])).
1.47/0.62	thf(f57,plain,(
1.47/0.62	  (ifSingleton = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f59,plain,(
1.47/0.62	  (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
1.47/0.62	  inference(cnf_transformation,[],[f15])).
1.47/0.62	thf(f15,plain,(
1.47/0.62	  (singleton = (^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))))),
1.47/0.62	  inference(fool_elimination,[],[f14])).
1.47/0.62	thf(f14,plain,(
1.47/0.62	  ((^[X0 : $i] : (? [X1] : (((setadjoin @ X1 @ emptyset) = X0) & (in @ X1 @ X0)))) = singleton)),
1.47/0.62	  inference(rectify,[],[f3])).
1.47/0.62	thf(f3,axiom,(
1.47/0.62	  ((^[X0 : $i] : (? [X2] : (((setadjoin @ X2 @ emptyset) = X0) & (in @ X2 @ X0)))) = singleton)),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',singleton)).
1.47/0.62	thf(f60,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (((in @ X7 @ X6) != $true) | ((singleton @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true) | ($true != (in @ X4 @ X6)) | (ifSingleton != $true)) )),
1.47/0.62	  inference(cnf_transformation,[],[f41])).
1.47/0.62	thf(f41,plain,(
1.47/0.62	  ((ifSingleton = $true) | ((($true = (in @ sK9 @ sK8)) & ($true != (singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & sK7) | ((~ sK7) & (sK9 = Y0)))))))) & ($true = (in @ sK6 @ sK8)))) & (! [X4,X5 : $o,X6] : (! [X7] : (((in @ X7 @ X6) != $true) | ((singleton @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true)) | ($true != (in @ X4 @ X6))) | (ifSingleton != $true))),
1.47/0.62	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9])],[f38,f40,f39])).
1.47/0.62	thf(f39,plain,(
1.47/0.62	  ? [X0,X1 : $o,X2] : (? [X3] : (((in @ X3 @ X2) = $true) & ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) != $true)) & ((in @ X0 @ X2) = $true)) => (? [X3] : (((in @ X3 @ sK8) = $true) & ((singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & sK7) | ((~ sK7) & (X3 = Y0)))))) != $true)) & ($true = (in @ sK6 @ sK8)))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f40,plain,(
1.47/0.62	  ? [X3] : (((in @ X3 @ sK8) = $true) & ((singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & sK7) | ((~ sK7) & (X3 = Y0)))))) != $true)) => (($true = (in @ sK9 @ sK8)) & ($true != (singleton @ (dsetconstr @ sK8 @ (^[Y0 : $i]: (((sK6 = Y0) & sK7) | ((~ sK7) & (sK9 = Y0))))))))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f38,plain,(
1.47/0.62	  ((ifSingleton = $true) | ? [X0,X1 : $o,X2] : (? [X3] : (((in @ X3 @ X2) = $true) & ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) != $true)) & ((in @ X0 @ X2) = $true))) & (! [X4,X5 : $o,X6] : (! [X7] : (((in @ X7 @ X6) != $true) | ((singleton @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))) = $true)) | ($true != (in @ X4 @ X6))) | (ifSingleton != $true))),
1.47/0.62	  inference(rectify,[],[f37])).
1.47/0.62	thf(f37,plain,(
1.47/0.62	  ((ifSingleton = $true) | ? [X0,X1 : $o,X2] : (? [X3] : (((in @ X3 @ X2) = $true) & ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) != $true)) & ((in @ X0 @ X2) = $true))) & (! [X0,X1 : $o,X2] : (! [X3] : (((in @ X3 @ X2) != $true) | ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) = $true)) | ((in @ X0 @ X2) != $true)) | (ifSingleton != $true))),
1.47/0.62	  inference(nnf_transformation,[],[f26])).
1.47/0.62	thf(f26,plain,(
1.47/0.62	  (ifSingleton = $true) <=> ! [X0,X1 : $o,X2] : (! [X3] : (((in @ X3 @ X2) != $true) | ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) = $true)) | ((in @ X0 @ X2) != $true))),
1.47/0.62	  inference(ennf_transformation,[],[f23])).
1.47/0.62	thf(f23,plain,(
1.47/0.62	  (ifSingleton = $true) <=> ! [X0,X1 : $o,X2] : (((in @ X0 @ X2) = $true) => ! [X3] : (((in @ X3 @ X2) = $true) => ((singleton @ (dsetconstr @ X2 @ (^[Y0 : $i]: (((X0 = Y0) & X1) | ((~ X1) & (X3 = Y0)))))) = $true)))),
1.47/0.62	  inference(fool_elimination,[],[f22])).
1.47/0.62	thf(f22,plain,(
1.47/0.62	  (ifSingleton = ! [X0,X1 : $o,X2] : ((in @ X0 @ X2) => ! [X3] : ((in @ X3 @ X2) => (singleton @ (dsetconstr @ X2 @ (^[X4 : $i] : (((X3 = X4) & ~X1) | (X1 & (X0 = X4)))))))))),
1.47/0.62	  inference(rectify,[],[f5])).
1.47/0.62	thf(f5,axiom,(
1.47/0.62	  (ifSingleton = ! [X2,X3 : $o,X0] : ((in @ X2 @ X0) => ! [X5] : ((in @ X5 @ X0) => (singleton @ (dsetconstr @ X0 @ (^[X6 : $i] : (((X5 = X6) & ~X3) | (X3 & (X2 = X6)))))))))),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',ifSingleton)).
1.47/0.62	thf(f115,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = (in @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f112])).
1.47/0.62	thf(f112,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true != $true) | ($true = (in @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))))) )),
1.47/0.62	  inference(superposition,[],[f109,f55])).
1.47/0.62	thf(f109,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $o] : (((in @ X0 @ sK2) != $true) | ((in @ (sK15 @ sK2 @ X0 @ sK3 @ X1) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X1) | ((~ X1) & (X0 = Y0)))))) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f107])).
1.47/0.62	thf(f107,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $o] : (((in @ X0 @ sK2) != $true) | ((in @ (sK15 @ sK2 @ X0 @ sK3 @ X1) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X1) | ((~ X1) & (X0 = Y0)))))) = $true) | ($true != $true)) )),
1.47/0.62	  inference(superposition,[],[f91,f56])).
1.47/0.62	thf(f91,plain,(
1.47/0.62	  ( ! [X6 : $i,X7 : $i,X4 : $i,X5 : $o] : (($true != (in @ X4 @ X6)) | ((in @ X7 @ X6) != $true) | ($true = (in @ (sK15 @ X6 @ X7 @ X4 @ X5) @ (dsetconstr @ X6 @ (^[Y0 : $i]: (((X4 = Y0) & X5) | ((~ X5) & (X7 = Y0)))))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f89])).
1.47/0.62	thf(f259,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) = $false) | ((in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) @ sK2) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f257])).
1.47/0.62	thf(f257,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true != $true) | ((in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) @ sK2) = $true) | ((in @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) = $false)) )),
1.47/0.62	  inference(superposition,[],[f214,f105])).
1.47/0.62	thf(f105,plain,(
1.47/0.62	  ( ! [X0 : $i] : (($true = (in @ (setunion @ (setadjoin @ X0 @ emptyset)) @ (setadjoin @ X0 @ emptyset))) | ($false = (in @ X0 @ (setadjoin @ X0 @ emptyset)))) )),
1.47/0.62	  inference(equality_resolution,[],[f102])).
1.47/0.62	thf(f102,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $i] : (((setadjoin @ X1 @ emptyset) != X0) | ((in @ (setunion @ X0) @ X0) = $true) | ((in @ X1 @ X0) = $false)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f101])).
1.47/0.62	thf(f101,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $i] : (((in @ X1 @ X0) = $false) | ((in @ (setunion @ X0) @ X0) = $true) | ($false = ((setadjoin @ X1 @ emptyset) = X0))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f100])).
1.47/0.62	thf(f100,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $i] : ((((in @ X1 @ X0) & ((setadjoin @ X1 @ emptyset) = X0)) = $false) | ((in @ (setunion @ X0) @ X0) = $true)) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f99])).
1.47/0.62	thf(f99,plain,(
1.47/0.62	  ( ! [X0 : $i,X1 : $i] : ((((^[Y0 : $i]: ((in @ Y0 @ X0) & ((setadjoin @ Y0 @ emptyset) = X0))) @ X1) = $false) | ((in @ (setunion @ X0) @ X0) = $true)) )),
1.47/0.62	  inference(pi_clausification,[],[f98])).
1.47/0.62	thf(f98,plain,(
1.47/0.62	  ( ! [X0 : $i] : (($true != (?? @ $i @ (^[Y0 : $i]: ((in @ Y0 @ X0) & ((setadjoin @ Y0 @ emptyset) = X0))))) | ((in @ (setunion @ X0) @ X0) = $true)) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f97])).
1.47/0.62	thf(f97,plain,(
1.47/0.62	  ( ! [X0 : $i] : (($true != ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ X0)) | ((in @ (setunion @ X0) @ X0) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f83])).
1.47/0.62	thf(f83,plain,(
1.47/0.62	  ( ! [X0 : $i] : (((in @ (setunion @ X0) @ X0) = $true) | ($true != $true) | ($true != ((^[Y0 : $i]: (?? @ $i @ (^[Y1 : $i]: ((in @ Y1 @ Y0) & ((setadjoin @ Y1 @ emptyset) = Y0))))) @ X0))) )),
1.47/0.62	  inference(definition_unfolding,[],[f71,f59,f58])).
1.47/0.62	thf(f58,plain,(
1.47/0.62	  (theprop = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f71,plain,(
1.47/0.62	  ( ! [X0 : $i] : (((in @ (setunion @ X0) @ X0) = $true) | ((singleton @ X0) != $true) | (theprop != $true)) )),
1.47/0.62	  inference(cnf_transformation,[],[f49])).
1.47/0.62	thf(f49,plain,(
1.47/0.62	  (! [X0] : (((in @ (setunion @ X0) @ X0) = $true) | ((singleton @ X0) != $true)) | (theprop != $true)) & ((theprop = $true) | (((in @ (setunion @ sK13) @ sK13) != $true) & ((singleton @ sK13) = $true)))),
1.47/0.62	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK13])],[f47,f48])).
1.47/0.62	thf(f48,plain,(
1.47/0.62	  ? [X1] : (((in @ (setunion @ X1) @ X1) != $true) & ((singleton @ X1) = $true)) => (((in @ (setunion @ sK13) @ sK13) != $true) & ((singleton @ sK13) = $true))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f47,plain,(
1.47/0.62	  (! [X0] : (((in @ (setunion @ X0) @ X0) = $true) | ((singleton @ X0) != $true)) | (theprop != $true)) & ((theprop = $true) | ? [X1] : (((in @ (setunion @ X1) @ X1) != $true) & ((singleton @ X1) = $true)))),
1.47/0.62	  inference(rectify,[],[f46])).
1.47/0.62	thf(f46,plain,(
1.47/0.62	  (! [X0] : (((in @ (setunion @ X0) @ X0) = $true) | ((singleton @ X0) != $true)) | (theprop != $true)) & ((theprop = $true) | ? [X0] : (((in @ (setunion @ X0) @ X0) != $true) & ((singleton @ X0) = $true)))),
1.47/0.62	  inference(nnf_transformation,[],[f29])).
1.47/0.62	thf(f29,plain,(
1.47/0.62	  ! [X0] : (((in @ (setunion @ X0) @ X0) = $true) | ((singleton @ X0) != $true)) <=> (theprop = $true)),
1.47/0.62	  inference(ennf_transformation,[],[f17])).
1.47/0.62	thf(f17,plain,(
1.47/0.62	  ! [X0] : (((singleton @ X0) = $true) => ((in @ (setunion @ X0) @ X0) = $true)) <=> (theprop = $true)),
1.47/0.62	  inference(fool_elimination,[],[f16])).
1.47/0.62	thf(f16,plain,(
1.47/0.62	  (! [X0] : ((singleton @ X0) => (in @ (setunion @ X0) @ X0)) = theprop)),
1.47/0.62	  inference(rectify,[],[f4])).
1.47/0.62	thf(f4,axiom,(
1.47/0.62	  (! [X4] : ((singleton @ X4) => (in @ (setunion @ X4) @ X4)) = theprop)),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',theprop)).
1.47/0.62	thf(f214,plain,(
1.47/0.62	  ( ! [X0 : $o,X1 : $i] : (((in @ X1 @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) != $true) | ((in @ X1 @ sK2) = $true)) )),
1.47/0.62	  inference(superposition,[],[f104,f144])).
1.47/0.62	thf(f104,plain,(
1.47/0.62	  ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ X1)) != $true) | ((in @ X2 @ X0) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f103])).
1.47/0.62	thf(f103,plain,(
1.47/0.62	  ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($true != $true) | ((in @ X2 @ (dsetconstr @ X0 @ X1)) != $true) | ((in @ X2 @ X0) = $true)) )),
1.47/0.62	  inference(superposition,[],[f93,f95])).
1.47/0.62	thf(f95,plain,(
1.47/0.62	  ( ! [X0 : $i > $o,X1 : $i] : (($true = (subset @ (dsetconstr @ X1 @ X0) @ X1))) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f94])).
1.47/0.62	thf(f94,plain,(
1.47/0.62	  ( ! [X0 : $i > $o,X1 : $i] : (((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f72])).
1.47/0.62	thf(f72,plain,(
1.47/0.62	  ( ! [X0 : $i > $o,X1 : $i] : (($true != $true) | ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true)) )),
1.47/0.62	  inference(definition_unfolding,[],[f51,f52])).
1.47/0.62	thf(f52,plain,(
1.47/0.62	  (sepSubset = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f51,plain,(
1.47/0.62	  ( ! [X0 : $i > $o,X1 : $i] : (((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true) | (sepSubset != $true)) )),
1.47/0.62	  inference(cnf_transformation,[],[f33])).
1.47/0.62	thf(f33,plain,(
1.47/0.62	  (! [X0 : $i > $o,X1] : ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true) | (sepSubset != $true)) & ((sepSubset = $true) | ((subset @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK0 @ Y0))) @ sK1) != $true))),
1.47/0.62	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f31,f32])).
1.47/0.62	thf(f32,plain,(
1.47/0.62	  ? [X2 : $i > $o,X3] : ((subset @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X2 @ Y0))) @ X3) != $true) => ((subset @ (dsetconstr @ sK1 @ (^[Y0 : $i]: (sK0 @ Y0))) @ sK1) != $true)),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f31,plain,(
1.47/0.62	  (! [X0 : $i > $o,X1] : ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true) | (sepSubset != $true)) & ((sepSubset = $true) | ? [X2 : $i > $o,X3] : ((subset @ (dsetconstr @ X3 @ (^[Y0 : $i]: (X2 @ Y0))) @ X3) != $true))),
1.47/0.62	  inference(rectify,[],[f30])).
1.47/0.62	thf(f30,plain,(
1.47/0.62	  (! [X0 : $i > $o,X1] : ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true) | (sepSubset != $true)) & ((sepSubset = $true) | ? [X0 : $i > $o,X1] : ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) != $true))),
1.47/0.62	  inference(nnf_transformation,[],[f11])).
1.47/0.62	thf(f11,plain,(
1.47/0.62	  ! [X0 : $i > $o,X1] : ((subset @ (dsetconstr @ X1 @ (^[Y0 : $i]: (X0 @ Y0))) @ X1) = $true) <=> (sepSubset = $true)),
1.47/0.62	  inference(fool_elimination,[],[f10])).
1.47/0.62	thf(f10,plain,(
1.47/0.62	  (! [X0 : $i > $o,X1] : (subset @ (dsetconstr @ X1 @ (^[X2 : $i] : (X0 @ X2))) @ X1) = sepSubset)),
1.47/0.62	  inference(rectify,[],[f2])).
1.47/0.62	thf(f2,axiom,(
1.47/0.62	  (! [X3 : $i > $o,X0] : (subset @ (dsetconstr @ X0 @ (^[X2 : $i] : (X3 @ X2))) @ X0) = sepSubset)),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',sepSubset)).
1.47/0.62	thf(f93,plain,(
1.47/0.62	  ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X4 @ X3)) | ((in @ X5 @ X3) = $true) | ((in @ X5 @ X4) != $true)) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f82])).
1.47/0.62	thf(f82,plain,(
1.47/0.62	  ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != $true) | ((in @ X5 @ X3) = $true) | ((in @ X5 @ X4) != $true) | ($true != (subset @ X4 @ X3))) )),
1.47/0.62	  inference(definition_unfolding,[],[f65,f53])).
1.47/0.62	thf(f53,plain,(
1.47/0.62	  (subsetE = $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f65,plain,(
1.47/0.62	  ( ! [X3 : $i,X4 : $i,X5 : $i] : (($true != (subset @ X4 @ X3)) | ((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true) | (subsetE != $true)) )),
1.47/0.62	  inference(cnf_transformation,[],[f45])).
1.47/0.62	thf(f45,plain,(
1.47/0.62	  ((subsetE = $true) | (((subset @ sK11 @ sK10) = $true) & ((in @ sK12 @ sK11) = $true) & ($true != (in @ sK12 @ sK10)))) & (! [X3,X4,X5] : (($true != (subset @ X4 @ X3)) | ((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) | (subsetE != $true))),
1.47/0.62	  inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f43,f44])).
1.47/0.62	thf(f44,plain,(
1.47/0.62	  ? [X0,X1,X2] : (((subset @ X1 @ X0) = $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true)) => (((subset @ sK11 @ sK10) = $true) & ((in @ sK12 @ sK11) = $true) & ($true != (in @ sK12 @ sK10)))),
1.47/0.62	  introduced(choice_axiom,[])).
1.47/0.62	thf(f43,plain,(
1.47/0.62	  ((subsetE = $true) | ? [X0,X1,X2] : (((subset @ X1 @ X0) = $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) & (! [X3,X4,X5] : (($true != (subset @ X4 @ X3)) | ((in @ X5 @ X4) != $true) | ((in @ X5 @ X3) = $true)) | (subsetE != $true))),
1.47/0.62	  inference(rectify,[],[f42])).
1.47/0.62	thf(f42,plain,(
1.47/0.62	  ((subsetE = $true) | ? [X0,X1,X2] : (((subset @ X1 @ X0) = $true) & ((in @ X2 @ X1) = $true) & ((in @ X2 @ X0) != $true))) & (! [X0,X1,X2] : (((subset @ X1 @ X0) != $true) | ((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true)) | (subsetE != $true))),
1.47/0.62	  inference(nnf_transformation,[],[f28])).
1.47/0.62	thf(f28,plain,(
1.47/0.62	  (subsetE = $true) <=> ! [X0,X1,X2] : (((subset @ X1 @ X0) != $true) | ((in @ X2 @ X1) != $true) | ((in @ X2 @ X0) = $true))),
1.47/0.62	  inference(flattening,[],[f27])).
1.47/0.62	thf(f27,plain,(
1.47/0.62	  (subsetE = $true) <=> ! [X0,X1,X2] : ((((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) != $true)) | ((subset @ X1 @ X0) != $true))),
1.47/0.62	  inference(ennf_transformation,[],[f13])).
1.47/0.62	thf(f13,plain,(
1.47/0.62	  (subsetE = $true) <=> ! [X0,X1,X2] : (((subset @ X1 @ X0) = $true) => (((in @ X2 @ X1) = $true) => ((in @ X2 @ X0) = $true)))),
1.47/0.62	  inference(fool_elimination,[],[f12])).
1.47/0.62	thf(f12,plain,(
1.47/0.62	  (subsetE = ! [X0,X1,X2] : ((subset @ X1 @ X0) => ((in @ X2 @ X1) => (in @ X2 @ X0))))),
1.47/0.62	  inference(rectify,[],[f1])).
1.47/0.62	thf(f1,axiom,(
1.47/0.62	  (subsetE = ! [X1,X0,X2] : ((subset @ X0 @ X1) => ((in @ X2 @ X0) => (in @ X2 @ X1))))),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',subsetE)).
1.47/0.62	thf(f213,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK5 @ sK3 @ X0) @ emptyset)) @ sK2) != $true) | ((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK5 = Y0)))))) )),
1.47/0.62	  inference(constrained_superposition,[],[f96,f144])).
1.47/0.62	thf(f1106,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK5 != (sK18 @ X0)) | ($true = X0) | (sK4 = $true)) )),
1.47/0.62	  inference(duplicate_literal_removal,[],[f1105])).
1.47/0.62	thf(f1105,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | (sK5 != (sK18 @ X0)) | (sK5 != (sK18 @ X0)) | (sK4 = $true)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f1104])).
1.47/0.62	thf(f1104,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | ((sK5 = (sK18 @ X0)) = $false) | (sK5 != (sK18 @ X0)) | (sK4 = $true)) )),
1.47/0.62	  inference(not_proxy_clausification,[],[f1103])).
1.47/0.62	thf(f1103,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = X0) | ($false = (~ sK4)) | (sK5 != (sK18 @ X0)) | ((sK5 = (sK18 @ X0)) = $false)) )),
1.47/0.62	  inference(not_proxy_clausification,[],[f1102])).
1.47/0.62	thf(f1102,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((~ X0) = $false) | ($false = (~ sK4)) | (sK5 != (sK18 @ X0)) | ((sK5 = (sK18 @ X0)) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1101])).
1.47/0.62	thf(f1101,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK5 = (sK18 @ X0)) & (~ sK4)) = $false) | ((~ X0) = $false) | (sK5 != (sK18 @ X0))) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f1100])).
1.47/0.62	thf(f1100,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((sK5 = (sK18 @ X0)) = $false) | ((~ X0) = $false) | (((sK5 = (sK18 @ X0)) & (~ sK4)) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1093])).
1.47/0.62	thf(f1093,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((~ X0) & (sK5 = (sK18 @ X0))) = $false) | (((sK5 = (sK18 @ X0)) & (~ sK4)) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1079])).
1.47/0.62	thf(f1079,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = ((sK4 & (sK3 = (sK18 @ X0))) | ((sK5 = (sK18 @ X0)) & (~ sK4)))) | (((~ X0) & (sK5 = (sK18 @ X0))) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1078])).
1.47/0.62	thf(f1078,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = (((sK3 = (sK18 @ X0)) & X0) | ((~ X0) & (sK5 = (sK18 @ X0))))) | ($false = ((sK4 & (sK3 = (sK18 @ X0))) | ((sK5 = (sK18 @ X0)) & (~ sK4))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f1076])).
1.47/0.62	thf(f96,plain,(
1.47/0.62	  ((in @ (setunion @ (dsetconstr @ sK2 @ (^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))))) @ sK2) != $true)),
1.47/0.62	  inference(beta_eta_normalization,[],[f74])).
1.47/0.62	thf(f74,plain,(
1.47/0.62	  ((in @ ((^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((Y3 = Y4) & (~ Y1))))))))))))) @ sK2 @ sK4 @ sK3 @ sK5) @ sK2) != $true)),
1.47/0.62	  inference(definition_unfolding,[],[f54,f64])).
1.47/0.62	thf(f64,plain,(
1.47/0.62	  (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((Y3 = Y4) & (~ Y1))))))))))))))),
1.47/0.62	  inference(cnf_transformation,[],[f21])).
1.47/0.62	thf(f21,plain,(
1.47/0.62	  (if = (^[Y0 : $i]: ((^[Y1 : $o]: ((^[Y2 : $i]: ((^[Y3 : $i]: (setunion @ (dsetconstr @ Y0 @ (^[Y4 : $i]: ((Y1 & (Y2 = Y4)) | ((Y3 = Y4) & (~ Y1))))))))))))))),
1.47/0.62	  inference(fool_elimination,[],[f20])).
1.47/0.62	thf(f20,plain,(
1.47/0.62	  ((^[X0 : $i, X1 : $o, X2 : $i, X3 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X4 : $i] : ((~X1 & (X3 = X4)) | ((X2 = X4) & X1)))))) = if)),
1.47/0.62	  inference(rectify,[],[f6])).
1.47/0.62	thf(f6,axiom,(
1.47/0.62	  ((^[X0 : $i, X3 : $o, X2 : $i, X5 : $i] : (setunion @ (dsetconstr @ X0 @ (^[X6 : $i] : ((~X3 & (X5 = X6)) | ((X2 = X6) & X3)))))) = if)),
1.47/0.62	  file('/export/starexec/sandbox/tmp/tmp.P7ixI7q8qW/E---3.1_6485.p',if)).
1.47/0.62	thf(f54,plain,(
1.47/0.62	  ((in @ (if @ sK2 @ sK4 @ sK3 @ sK5) @ sK2) != $true)),
1.47/0.62	  inference(cnf_transformation,[],[f36])).
1.47/0.62	thf(f695,plain,(
1.47/0.62	  ~spl14_5 | ~spl14_12),
1.47/0.62	  inference(avatar_contradiction_clause,[],[f694])).
1.47/0.62	thf(f694,plain,(
1.47/0.62	  $false | (~spl14_5 | ~spl14_12)),
1.47/0.62	  inference(subsumption_resolution,[],[f693,f501])).
1.47/0.62	thf(f501,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = X0)) ) | (~spl14_5 | ~spl14_12)),
1.47/0.62	  inference(subsumption_resolution,[],[f499,f468])).
1.47/0.62	thf(f468,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 = (sK17 @ X0)) | ($false = X0)) ) | ~spl14_5),
1.47/0.62	  inference(avatar_component_clause,[],[f467])).
1.47/0.62	thf(f467,plain,(
1.47/0.62	  spl14_5 <=> ! [X0 : $o] : ((sK3 = (sK17 @ X0)) | ($false = X0))),
1.47/0.62	  introduced(avatar_definition,[new_symbols(naming,[spl14_5])])).
1.47/0.62	thf(f499,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 != (sK17 @ X0)) | ($false = X0)) ) | ~spl14_12),
1.47/0.62	  inference(avatar_component_clause,[],[f498])).
1.47/0.62	thf(f498,plain,(
1.47/0.62	  spl14_12 <=> ! [X0 : $o] : (($false = X0) | (sK3 != (sK17 @ X0)))),
1.47/0.62	  introduced(avatar_definition,[new_symbols(naming,[spl14_12])])).
1.47/0.62	thf(f693,plain,(
1.47/0.62	  ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ X1)) != $false)) ) | (~spl14_5 | ~spl14_12)),
1.47/0.62	  inference(forward_demodulation,[],[f579,f501])).
1.47/0.62	thf(f579,plain,(
1.47/0.62	  ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (((in @ X2 @ (dsetconstr @ X0 @ X1)) != $true)) ) | (~spl14_5 | ~spl14_12)),
1.47/0.62	  inference(trivial_inequality_removal,[],[f506])).
1.47/0.62	thf(f506,plain,(
1.47/0.62	  ( ! [X2 : $i,X0 : $i,X1 : $i > $o] : (($false = $true) | ((in @ X2 @ (dsetconstr @ X0 @ X1)) != $true)) ) | (~spl14_5 | ~spl14_12)),
1.47/0.62	  inference(backward_demodulation,[],[f104,f501])).
1.47/0.62	thf(f500,plain,(
1.47/0.62	  spl14_1 | spl14_12),
1.47/0.62	  inference(avatar_split_clause,[],[f361,f498,f451])).
1.47/0.62	thf(f361,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = X0) | (sK4 = $false) | (sK3 != (sK17 @ X0))) )),
1.47/0.62	  inference(duplicate_literal_removal,[],[f360])).
1.47/0.62	thf(f360,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 != (sK17 @ X0)) | (sK3 != (sK17 @ X0)) | ($false = X0) | (sK4 = $false)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f359])).
1.47/0.62	thf(f359,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = X0) | ((sK3 = (sK17 @ X0)) = $false) | (sK4 = $false) | (sK3 != (sK17 @ X0))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f358])).
1.47/0.62	thf(f358,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((sK4 & (sK3 = (sK17 @ X0))) = $false) | ($false = X0) | (sK3 != (sK17 @ X0))) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f357])).
1.47/0.62	thf(f357,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((sK3 = (sK17 @ X0)) = $false) | ((sK4 & (sK3 = (sK17 @ X0))) = $false) | ($false = X0)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f355])).
1.47/0.62	thf(f355,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK4 & (sK3 = (sK17 @ X0))) | ((sK5 = (sK17 @ X0)) & (~ sK4))) = $false) | ($false = X0) | ((sK3 = (sK17 @ X0)) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f354])).
1.47/0.62	thf(f354,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = ((sK3 = (sK17 @ X0)) & X0)) | (((sK4 & (sK3 = (sK17 @ X0))) | ((sK5 = (sK17 @ X0)) & (~ sK4))) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f352])).
1.47/0.62	thf(f352,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $false) | (((sK4 & (sK3 = (sK17 @ X0))) | ((sK5 = (sK17 @ X0)) & (~ sK4))) = $false)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f350])).
1.47/0.62	thf(f350,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) != ((sK4 & (sK3 = (sK17 @ X0))) | ((sK5 = (sK17 @ X0)) & (~ sK4))))) )),
1.47/0.62	  inference(beta_eta_normalization,[],[f349])).
1.47/0.62	thf(f349,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0)))) @ (sK17 @ X0)) != ((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) @ (sK17 @ X0)))) )),
1.47/0.62	  inference(negative_extensionality,[],[f348])).
1.47/0.62	thf(f348,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0)))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f347])).
1.47/0.62	thf(f347,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0))))) | ($true != $true)) )),
1.47/0.62	  inference(backward_demodulation,[],[f205,f346])).
1.47/0.62	thf(f346,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = (in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) @ sK2))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f338])).
1.47/0.62	thf(f338,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($false = $true) | ($true = (in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) @ sK2))) )),
1.47/0.62	  inference(superposition,[],[f249,f150])).
1.47/0.62	thf(f150,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) = $true)) )),
1.47/0.62	  inference(backward_demodulation,[],[f114,f143])).
1.47/0.62	thf(f143,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset) = (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0))))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f141])).
1.47/0.62	thf(f141,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true != $true) | ((setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset) = (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0))))))) )),
1.47/0.62	  inference(superposition,[],[f120,f56])).
1.47/0.62	thf(f114,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = (in @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0)))))))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f113])).
1.47/0.62	thf(f113,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true != $true) | ($true = (in @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ (dsetconstr @ sK2 @ (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0)))))))) )),
1.47/0.62	  inference(superposition,[],[f109,f56])).
1.47/0.62	thf(f249,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) = $false) | ($true = (in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) @ sK2))) )),
1.47/0.62	  inference(trivial_inequality_removal,[],[f247])).
1.47/0.62	thf(f247,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((in @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) = $false) | ($true != $true) | ($true = (in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) @ sK2))) )),
1.47/0.62	  inference(superposition,[],[f206,f105])).
1.47/0.62	thf(f206,plain,(
1.47/0.62	  ( ! [X0 : $o,X1 : $i] : (((in @ X1 @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) != $true) | ((in @ X1 @ sK2) = $true)) )),
1.47/0.62	  inference(superposition,[],[f104,f143])).
1.47/0.62	thf(f205,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((^[Y0 : $i]: ((sK4 & (sK3 = Y0)) | ((sK5 = Y0) & (~ sK4)))) != (^[Y0 : $i]: (((sK3 = Y0) & X0) | ((~ X0) & (sK3 = Y0))))) | ($true != (in @ (setunion @ (setadjoin @ (sK15 @ sK2 @ sK3 @ sK3 @ X0) @ emptyset)) @ sK2))) )),
1.47/0.62	  inference(constrained_superposition,[],[f96,f143])).
1.47/0.62	thf(f469,plain,(
1.47/0.62	  spl14_5 | spl14_1),
1.47/0.62	  inference(avatar_split_clause,[],[f440,f451,f467])).
1.47/0.62	thf(f440,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 = (sK17 @ X0)) | (sK4 = $false) | ($false = X0)) )),
1.47/0.62	  inference(not_proxy_clausification,[],[f439])).
1.47/0.62	thf(f439,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((~ X0) = $true) | (sK4 = $false) | (sK3 = (sK17 @ X0))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f437])).
1.47/0.62	thf(f437,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK4 = $false) | (sK3 = (sK17 @ X0)) | ($true = ((~ X0) & (sK3 = (sK17 @ X0))))) )),
1.47/0.62	  inference(not_proxy_clausification,[],[f436])).
1.47/0.62	thf(f436,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 = (sK17 @ X0)) | ((~ sK4) = $true) | ($true = ((~ X0) & (sK3 = (sK17 @ X0))))) )),
1.47/0.62	  inference(duplicate_literal_removal,[],[f435])).
1.47/0.62	thf(f435,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = ((~ X0) & (sK3 = (sK17 @ X0)))) | (sK3 = (sK17 @ X0)) | ((~ sK4) = $true) | (sK3 = (sK17 @ X0))) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f434])).
1.47/0.62	thf(f434,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((sK3 = (sK17 @ X0)) | ((sK3 = (sK17 @ X0)) = $true) | ((~ sK4) = $true) | ($true = ((~ X0) & (sK3 = (sK17 @ X0))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f432])).
1.47/0.62	thf(f432,plain,(
1.47/0.62	  ( ! [X0 : $o] : (($true = ((sK3 = (sK17 @ X0)) & X0)) | ((~ sK4) = $true) | (sK3 = (sK17 @ X0)) | ($true = ((~ X0) & (sK3 = (sK17 @ X0))))) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f431])).
1.47/0.62	thf(f431,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $true) | (sK3 = (sK17 @ X0)) | ((~ sK4) = $true)) )),
1.47/0.62	  inference(equality_proxy_clausification,[],[f415])).
1.47/0.62	thf(f415,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((sK3 = (sK17 @ X0)) = $true) | ((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $true) | ((~ sK4) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f378])).
1.47/0.62	thf(f378,plain,(
1.47/0.62	  ( ! [X0 : $o] : (((sK4 & (sK3 = (sK17 @ X0))) = $true) | ((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $true) | ((~ sK4) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f377])).
1.47/0.62	thf(f377,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK5 = (sK17 @ X0)) & (~ sK4)) = $true) | ((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $true) | ((sK4 & (sK3 = (sK17 @ X0))) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f351])).
1.47/0.62	thf(f351,plain,(
1.47/0.62	  ( ! [X0 : $o] : ((((sK4 & (sK3 = (sK17 @ X0))) | ((sK5 = (sK17 @ X0)) & (~ sK4))) = $true) | ((((sK3 = (sK17 @ X0)) & X0) | ((~ X0) & (sK3 = (sK17 @ X0)))) = $true)) )),
1.47/0.62	  inference(binary_proxy_clausification,[],[f350])).
1.47/0.62	% SZS output end Proof for E---3.1_6485
1.47/0.62	% (6613)------------------------------
1.47/0.62	% (6613)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200)
1.47/0.62	% (6613)Termination reason: Refutation
1.47/0.62	
1.47/0.62	% (6613)Memory used [KB]: 6396
1.47/0.62	% (6613)Time elapsed: 0.152 s
1.47/0.62	% (6613)Instructions burned: 392 (million)
1.47/0.62	% (6613)------------------------------
1.47/0.62	% (6613)------------------------------
1.47/0.62	% (6592)Success in time 0.241 s
1.47/0.62	EOF